A Conformant Planner with Explicit Disjunctive Representation of Belief States
نویسندگان
چکیده
This paper describes a novel and competitive complete conformant planner. Key to the enhanced performance is an efficient encoding of belief states as disjunctive normal form formulae and an efficient procedure for computing the successor belief state. We provide experimental comparative evaluation on a large pool of benchmarks. The novel design provides great efficiency and enhanced scalability, along with the intuitive structure of disjunctive normal form representations.
منابع مشابه
A New Approach to Contingent Planning Using A Disjunctive Representation in AND/OR forward Search with Novel Pruning Techniques
This paper introduces a highly competitive contingent planner, that uses the novel idea of encoding belief states as disjunctive normal form formulae proposed by To, Pontelli, and Son for conformant planning, for the search for solutions in the belief space. In the previous work for conformant planning, a complete transition function for computing successor belief states under the representatio...
متن کاملA New Approach to Conformant Planning Using CNF*
In this paper, we develop a heuristic, progression based conformant planner, called CNF, which represents belief states by a special type of CNF formulae, called CNF-state. We define a transition function ΦCNF for computing the successor belief state resulting from the execution of an action in a belief state and prove that it is sound and complete with respect to the complete semantics defined...
متن کاملOn the Use of Prime Implicates in Conformant Planning
The paper presents an investigation of the use of two alternative forms of CNF formulae—prime implicates and minimal CNF—to compactly represent belief states in the context of conformant planning. For each representation, we define a transition function for computing the successor belief state resulting from the execution of an action in a belief state; results concerning soundness and complete...
متن کاملPlanning in Belief Space with a Labelled Uncertainty Graph
Planning in belief space with a Labelled Uncertainty Graph, LUG, is an approach that uses a very compact planning graph to guide search in the space of belief states to construct conformant and contingent plans. A conformant plan is a plan that transitions (without sensing) all possible initial states through possibly non-deterministic actions to a goal state. A contingent plan adds the ability...
متن کاملPlanning Graph Heuristics for Incomplete and Non-Deterministic Domains
This doctoral work centers on developing domain-independent heuristics for planning problems characterized by state incompleteness and action non-determinism. The key means by which the heuristics are computed is through planning graph analysis. The approach has been used to construct conformant and contingent plans in two different search techniques. The initial focus of the research was inves...
متن کامل